#include <iostream>
#include <cstring>
struct node{
    int x;
    int y;
}dian[1010];
using namespace std;
double determinant(double v1, double v2, double v3, double v4)  // 行列式
{
    return (v1*v3-v2*v4);
}

bool intersect3(node aa, node bb, node cc, node dd)
{
    double delta = determinant(bb.x-aa.x, cc.x-dd.x, bb.y-aa.y, cc.y-dd.y);
    if ( delta<=(1e-6) && delta>=-(1e-6) )  // delta=0，表示两线段重合或平行
    {
        return false;
    }
    double namenda = determinant(cc.x-aa.x, cc.x-dd.x, cc.y-aa.y, cc.y-dd.y) / delta;
    if ( namenda>1 || namenda<0 )
    {
        return false;
    }
    double miu = determinant(bb.x-aa.x, cc.x-aa.x, bb.y-aa.y, cc.y-aa.y) / delta;
    if ( miu>1 || miu<0 )
    {
        return false;
    }
    return true;
}
int main(){
    long long n;
    while (cin >> n){
        for(long long i = 0;i < n; i++){
            cin>>dian[i].x>>dian[i].y;
        }
    }
    return 0;
}

